New Routing Rules for Dynamic Flexible Job Shop Scheduling with Sequence-Dependent Setup Times
نویسندگان
چکیده
Flexible job shops are characterized by the existence of alternative –not necessarily identicalmachines, which permits parts to have different alternative routes in the shop. In a dynamic scheduling situation in which jobs continuously arrive over time, part routing rules are needed to deal with such routing flexibility as much as sequencing rules which define the order by which parts are admitted to machines. This paper considers a dynamic flexible job shop scheduling in which there are sequence-dependent setup times and machines are prone to failure. Three new routing rules are proposed and compared with another two rules from the literature through simulation experiments.
منابع مشابه
New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملA fuzzy multi-objective linear programming approach for solving a new multi-objective job shop scheduling with sequence-dependent setup times
This paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. For solving this multi-objective model, we develop a fuzzy multi-objective linear programming (FMOLP) model. In this problem, a proposed FMOLP method is applied with respect to the o...
متن کاملMinimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times
The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملA Job Shop Scheduling Problem with Sequence-Dependent Setup Times Considering Position-Based Learning Effects and Availability Constraints
Sequence dependent set-up times scheduling problems (SDSTs), availability constraint and transportation times are interesting and important issues in production management, which are often addressed separately. In this paper, the SDSTs job shop scheduling problem with position-based learning effects, job-dependent transportation times and multiple preventive maintenance activities is studied. ...
متن کامل